Smoothing Factor and Actual Multigrid Convergence
نویسندگان
چکیده
We consider the Fourier analysis of multi-grid methods for symmetric positive definite and semi-positive definite linear systems arising from the discretizations of scalar PDEs. In this framework, the smoothing factor is frequently used to estimate the potential of a multigrid approach. In this paper, the smoothing factor is related to the actual two-grid convergence rate and also to the Vcycle convergence estimate based on McCormick theory in [SIAM J. Numer.Anal., 22(1985), pp.634643]. A two-sided bound is obtained that defines an interval containing both the two-grid and V-cycle convergence rate. This interval is narrow when an additional parameter is small enough, which is a simple function of quantities available in standard Fourier analysis. From a qualitative viewpoint, it turns out that, besides the smoothing factor, the convergence mainly depends on the angle between the eigenvectors of the matrix associated with small eigenvalues and the range of the prolongation. Nice V-cycle convergence is guaranteed if the tangent of this angle is proportional to the eigenvalue, whereas nice two-grid convergence requires the tangent to be proportional only to the square root of the eigenvalue. The presented results apply to rigorous Fourier analysis for regular discrete PDEs, and also to local Fourier analysis via the discussion of semi-definite systems as may arise from the discretization of PDEs with periodic boundary conditions.
منابع مشابه
Smoothing factor, order of prolongation and actual multigrid convergence
We consider the Fourier analysis of multi-grid methods (of Galerkin type) for symmetric positive definite and semi-positive definite linear systems arising from the discretization of scalar partial differential equations (PDEs). We relate the so-called smoothing factor to the actual two-grid convergence rate and also to the convergence rate of the V-cycle multigrid. We derive a two-sided bound ...
متن کاملAnalysis of a new Red-Black Ordering for Gauss-Seidel Smoothing in Cell-Centred Multigrid
Based on numerical experiments with a cell-centred multigrid Poisson solver in one and two dimensions, we propose to use Alternating Coarse-Line Zebra ordering as a robust parallel smoother for the 2D case. The algorithm is presented based on a heuristic discussion, and the convergence rates obtained with diierent smoothers are compared. Local mode analysis is used to estimate the smoothing fac...
متن کاملConvergence Analysis of Perturbed Two-Grid and Multigrid Methods
We consider multigrid methods for symmetric positive definite linear systems. We present a new algebraic convergence analysis of two-grid schemes with inexact solution of the coarse grid system. This analysis allows us to bound the convergence factor of such perturbed two-grid schemes, assuming only a certain bound on the convergence factor for the unperturbed scheme (with exact solution of the...
متن کاملJohann Radon Institute for Computational and Applied Mathematics
We present (geometric) multigrid methods for isogeometric discretization of scalar second order elliptic problems. The smoothing property of the relaxation method, and the approximation property of the intergrid transfer operators are analyzed. These properties, when used in the framework of classical multigrid theory, imply uniform convergence of two-grid and multigrid methods. Supporting nume...
متن کاملFast and High Accuracy Multigrid Solution of the Three Dimensional Poisson Equation
We employ a fourth-order compact finite difference scheme (FOS) with the multigrid algorithm to solve the three dimensional Poisson equation. We test the influence of different orderings of the grid space and different grid-transfer operators on the convergence and efficiency of our high accuracy algorithm. Fourier smoothing analysis is conducted to show that FOS has a smaller smoothing factor ...
متن کامل